71![A SUMMARY OF MY RESEARCH (MARCHJ.M. LANDSBERG I have wide research interests: Cartan style differential geometry, classically influenced algebraic geometry, the geometry of homogeneous varieties, categorical gener A SUMMARY OF MY RESEARCH (MARCHJ.M. LANDSBERG I have wide research interests: Cartan style differential geometry, classically influenced algebraic geometry, the geometry of homogeneous varieties, categorical gener](https://www.pdfsearch.io/img/1f934a9224e6f7885e8a2e4ac0d9f15d.jpg) | Add to Reading ListSource URL: www.math.tamu.eduLanguage: English - Date: 2016-07-25 08:53:57
|
---|
72![THE BETA-JACOBI MATRIX MODEL, THE CS DECOMPOSITION, AND GENERALIZED SINGULAR VALUE PROBLEMS ALAN EDELMAN AND BRIAN D. SUTTON Abstract. We provide a solution to the β-Jacobi matrix model problem THE BETA-JACOBI MATRIX MODEL, THE CS DECOMPOSITION, AND GENERALIZED SINGULAR VALUE PROBLEMS ALAN EDELMAN AND BRIAN D. SUTTON Abstract. We provide a solution to the β-Jacobi matrix model problem](https://www.pdfsearch.io/img/e9ad7b266e6f9c5f91ffdd7d54d3a646.jpg) | Add to Reading ListSource URL: faculty.rmc.eduLanguage: English - Date: 2007-08-01 16:16:47
|
---|
73![Curriculum Vitae Jose E. Roman D. Sistemes Inform` atics i Computaci´ o Universitat Polit`ecnica de Val`encia Curriculum Vitae Jose E. Roman D. Sistemes Inform` atics i Computaci´ o Universitat Polit`ecnica de Val`encia](https://www.pdfsearch.io/img/baf5412897235b2f32d20f8219d466a9.jpg) | Add to Reading ListSource URL: users.dsic.upv.esLanguage: English - Date: 2016-07-09 06:46:12
|
---|
74![331 Documenta Math. The Projected Single-Particle Dirac Operator for Coulombic Potentials 331 Documenta Math. The Projected Single-Particle Dirac Operator for Coulombic Potentials](https://www.pdfsearch.io/img/7856b1362f8bb038b619c0b0d6c6f526.jpg) | Add to Reading ListSource URL: documenta.sagemath.orgLanguage: English - Date: 2005-11-04 17:24:36
|
---|
75![ON THE CONDITIONING OF RANDOM SUBDICTIONARIES JOEL A. TROPP Abstract. An important problem in the theory of sparse approximation is to identify wellconditioned subsets of vectors from a general dictionary. In most cases, ON THE CONDITIONING OF RANDOM SUBDICTIONARIES JOEL A. TROPP Abstract. An important problem in the theory of sparse approximation is to identify wellconditioned subsets of vectors from a general dictionary. In most cases,](https://www.pdfsearch.io/img/1582436fd3b2586d591c2bb6bf516119.jpg) | Add to Reading ListSource URL: users.cms.caltech.eduLanguage: English - Date: 2007-09-11 17:01:58
|
---|
76![EigenfactorTM Score and Article Influence Score: Detailed methods∗ TM Here we describe the methods used to compute the EigenfactorTM scores EigenfactorTM Score and Article Influence Score: Detailed methods∗ TM Here we describe the methods used to compute the EigenfactorTM scores](https://www.pdfsearch.io/img/a4890754c40087770aae89f46b15b755.jpg) | Add to Reading ListSource URL: well-formed.eigenfactor.orgLanguage: English - Date: 2015-06-22 01:55:08
|
---|
77![c 2003 Society for Industrial and Applied Mathematics SIAM J. MATRIX ANAL. APPL. Vol. 25, No. 1, pp. 1–30 c 2003 Society for Industrial and Applied Mathematics SIAM J. MATRIX ANAL. APPL. Vol. 25, No. 1, pp. 1–30](https://www.pdfsearch.io/img/f275681b0afce2650105b0b4dbcd91b5.jpg) | Add to Reading ListSource URL: www.ti3.tu-harburg.deLanguage: English - Date: 2005-11-22 10:14:36
|
---|
78![57 Documenta Math. On the Scattering Theory of the Laplacian with a Periodic Boundary Condition. 57 Documenta Math. On the Scattering Theory of the Laplacian with a Periodic Boundary Condition.](https://www.pdfsearch.io/img/39f8d22f00bd62e5aee8d3a7fbfea008.jpg) | Add to Reading ListSource URL: documenta.sagemath.orgLanguage: English - Date: 2004-03-18 13:56:20
|
---|
79![EE103/CME103: Introduction to Matrix Methods OctoberS. Boyd Midterm Exam EE103/CME103: Introduction to Matrix Methods OctoberS. Boyd Midterm Exam](https://www.pdfsearch.io/img/56d323ee45d8ec9beb4586eb32be11f1.jpg) | Add to Reading ListSource URL: stanford.eduLanguage: English - Date: 2015-10-22 14:39:52
|
---|
80![Assignment 4 Randomization in Numerical Linear Algebra (PCMI) 1. We will prove a structural inequality that can be used as a starting point in many RandNLA algorithms. More specifically, we will prove the following lemma Assignment 4 Randomization in Numerical Linear Algebra (PCMI) 1. We will prove a structural inequality that can be used as a starting point in many RandNLA algorithms. More specifically, we will prove the following lemma](https://www.pdfsearch.io/img/14c91413c736dde758c79d95ec78aa43.jpg) | Add to Reading ListSource URL: www.drineas.orgLanguage: English - Date: 2016-07-02 06:19:59
|
---|